The stable set polytope and some operations on graphs
نویسندگان
چکیده
منابع مشابه
On the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کاملColoring planar Toeplitz graphs and the stable set polytope
Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...
متن کاملGear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields counterexamples to a conjecture on the facial structure of STAB(G) when G is claw-free.
متن کاملThe stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs
The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine ...
متن کاملOn the facets of the stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00273-4